Limitwise monotonic functions, sets, and degrees on computable domains
نویسندگان
چکیده
We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increasing) limitwise monotonic on various
منابع مشابه
Limitwise monotonic sets of reals
1. f (x, s) f (x, s + 1) for all x and s; 2. sups f (x, s) < ∞ for every x ; 3. F(x) = sups f (x, s). A set A ⊆ N is limitwise monotonic if A equals to the range of some limitwise monotonic function. If we replace here the computable functions f by X -computable functions for some Turing oracle X then we get the notions of X -limitwise monotonic functions and sets, respectively. Note that a sim...
متن کاملLimitwise Monotonic Functions and Their Applications
We survey what is known about limitwise monotonic functions and sets and discuss their applications in effective algebra and computable model theory. Additionally, we characterize the computably enumerable degrees that are totally limitwise monotonic, show the support strictly increasing 0′-limitwise monotonic sets on Q do not capture the sets with computable strong η-representations, and study...
متن کاملCharacterizing the Computable Structures: Boolean Algebras and Linear Orders
A countable structure (with finite signature) is computable if its universe can be identified with ω in such a way as to make the relations and operations computable functions. In this thesis, I study which Boolean algebras and linear orders are computable. Making use of Ketonen invariants, I study the Boolean algebras of low Ketonen depth, both classically and effectively. Classically, I give ...
متن کاملOn limitwise monotonicity and maximal block functions
We prove the existence of a limitwise monotonic function g : N→ N \ {0} such that, for any Π1 function f : N → N \ {0}, Ran f 6= Ran g. Relativising this result we deduce the existence of an η-like computable linear ordering A such that, for any Π2 function F : Q → N \ {0}, and η-like B of order type ∑ {F (q) | q ∈ Q }, B A . We prove directly that, for any computable A which is either (i) stro...
متن کاملComputable shuffle sums of ordinals
The main result is that for sets S ⊆ ω + 1, the following are equivalent: (1) The shuffle sum σ(S) is computable. (2) The set S is a liminf set, i.e. there is a total computable function g(x, t) such that f(x) = lim inft g(x, t) enumerates S. (3) The set S is a limitwise monotonic set relative to 0′, i.e. there is a total 0′-computable function g̃(x, t) satisfying g̃(x, t) ≤ g̃(x, t + 1) such that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 75 شماره
صفحات -
تاریخ انتشار 2010